Efficient Numerical Methods for Least-Norm Regularization
نویسندگان
چکیده
The problem min x ‖x‖, s.t. ‖b−Ax‖ ≤ arises in the regularization of discrete forms of ill-posed problems when an estimate of the noise level in the data is available. After deriving necessary and sufficient optimality conditions for this problem, we propose two different classes of algorithms: a factorization-based algorithm for small to medium problems, and matrix-free iterations for the large-scale case. Numerical results illustrating the performance of the methods demonstrate that both classes of algorithms are efficient, robust, and accurate. An interesting feature of our formulation is that there is no situation corresponding to the so-called hard case that occurs in the standard trust-region subproblem. Neither small singular values nor vanishing coefficients present any difficulty to solving the relevant secular equations.
منابع مشابه
Large-scale Inversion of Magnetic Data Using Golub-Kahan Bidiagonalization with Truncated Generalized Cross Validation for Regularization Parameter Estimation
In this paper a fast method for large-scale sparse inversion of magnetic data is considered. The L1-norm stabilizer is used to generate models with sharp and distinct interfaces. To deal with the non-linearity introduced by the L1-norm, a model-space iteratively reweighted least squares algorithm is used. The original model matrix is factorized using the Golub-Kahan bidiagonalization that proje...
متن کاملروشهای تجزیه مقادیر منفرد منقطع و تیخونوف تعمیمیافته در پایدارسازی مسئله انتقال به سمت پائین
The methods applied to regularization of the ill-posed problems can be classified under “direct” and “indirect” methods. Practice has shown that the effects of different regularization techniques on an ill-posed problem are not the same, and as such each ill-posed problem requires its own investigation in order to identify its most suitable regularization method. In the geoid computations witho...
متن کاملA Primal Dual - Interior Point Framework for Using the L1-Norm or the L2-Norm on the Data and Regularization Terms of Inverse Problems
Maximum A Posteriori (MAP) estimates in inverse problems are often based on quadratic formulations, corresponding to a Least Squares fitting of the data and to the use of the L2 norm on the regularization term. While the implementation of this estimation is straightforward and usually based on the Gauss Newton method, resulting estimates are sensitive to outliers, and spatial distributions of t...
متن کاملA Mathematical Analysis of New L-curve to Estimate the Parameters of Regularization in TSVD Method
A new technique to find the optimization parameter in TSVD regularization method is based on a curve which is drawn against the residual norm [5]. Since the TSVD regularization is a method with discrete regularization parameter, then the above-mentioned curve is also discrete. In this paper we present a mathematical analysis of this curve, showing that the curve has L-shaped path very similar t...
متن کاملDiscrete Ill-posed Least-squares Problems with a Solution Norm Constraint
Straightforward solution of discrete ill-posed least-squares problems with errorcontaminated data does not, in general, give meaningful results, because propagated error destroys the computed solution. Error propagation can be reduced by imposing constraints on the computed solution. A commonly used constraint is the discrepancy principle, which bounds the norm of the computed solution when app...
متن کامل